Buhrman, Harry : rechercher sur Z-Library

Le plus grand référentiel d'articles scientifiques au monde. 70,000,000+ d'articles gratuitement.

Don't use scam websites

Livres
Articles (83)
Les plus populaires
Liste
- Liste
- Tableau

1

Nonlocality and communication complexity

Buhrman, Harry, Cleve, Richard, Massar, Serge, de Wolf, Ronald

Journal:

Review of Modern Physics

Année:

2010

Langue:

english

Fichier:

PDF, 540 KB

english, 2010

2

Separating Complexity Classes Using Autoreducibility

Buhrman, Harry, Fortnow, Lance, van Melkebeek, Dieter, Torenvliet, Leen

Journal:

SIAM Journal on Computing

Année:

2000

Langue:

english

Fichier:

PDF, 268 KB

english, 2000

3

Some Results on Derandomization

Harry Buhrman, Lance Fortnow, A. Pavan

Journal:

Theory of Computing Systems

Année:

2005

Langue:

english

Fichier:

PDF, 214 KB

english, 2005

4

Quantum communication complexity advantage implies violation of a Bell inequality

Buhrman, Harry, Czekaj, Łukasz, Grudka, Andrzej, Horodecki, Michał, Horodecki, Paweł, Markiewicz, Marcin, Speelman, Florian, Strelchuk, Sergii

Journal:

Proceedings of the National Academy of Sciences

Année:

2016

Langue:

english

Fichier:

PDF, 941 KB

english, 2016

5

Complexity measures and decision tree complexity: a survey

Harry Buhrman, Ronald de Wolf

Journal:

Theoretical Computer Science

Année:

2002

Langue:

english

Fichier:

PDF, 183 KB

english, 2002

6

A Generalized Grothendieck Inequality and Nonlocal Correlations that Require High Entanglement

Jop Briët, Harry Buhrman, Ben Toner

Journal:

Communications in Mathematical Physics

Année:

2011

Langue:

english

Fichier:

PDF, 269 KB

english, 2011

7

Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?

Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolay Vereshchagin

Journal:

Theory of Computing Systems

Année:

2010

Langue:

english

Fichier:

PDF, 373 KB

english, 2010

8

All Schatten spaces endowed with the Schur product are Q-algebras

Jop Briët, Harry Buhrman, Troy Lee, Thomas Vidick

Journal:

Journal of Functional Analysis

Année:

2012

Langue:

english

Fichier:

PDF, 120 KB

english, 2012

9

Quantum Entanglement and Communication Complexity

Buhrman, Harry, Cleve, Richard, van Dam, Wim

Journal:

SIAM Journal on Computing

Année:

2001

Langue:

english

Fichier:

PDF, 161 KB

english, 2001

10

Communication complexity: Eyal Kushilevitz, Noam Nisan, Cambridge University Press, Cambridge, 1997. ISBN 0-56067-5

Journal:

Science of Computer Programming

Année:

1999

Langue:

english

Fichier:

PDF, 74 KB

english, 1999

11

[IEEE 2010 IEEE 25th Annual Conference on Computational Complexity (CCC) - Cambridge, MA, USA (2010.06.9-2010.06.12)] 2010 IEEE 25th Annual Conference on Computational Complexity - Derandomizing from Random Strings

Buhrman, Harry, Fortnow, Lance, Koucký, Michal, Loff, Bruno

Année:

2010

Langue:

english

Fichier:

PDF, 329 KB

english, 2010

12

Sparse Selfreducible Sets and Nonuniform Lower Bounds

Buhrman, Harry, Torenvliet, Leen, Unger, Falk, Vereshchagin, Nikolay

Journal:

Année:

2019

Langue:

english

Fichier:

PDF, 611 KB

english, 2019

13

P-Selective Self-Reducible Sets: A New Characterization of P

Harry Buhrman, Leen Torenvliet

Journal:

Journal of Computer and System Sciences

Année:

1996

Langue:

english

Fichier:

PDF, 361 KB

english, 1996

14

Random Strings Make Hard Instances

Harry Buhrman, Pekka Orponen

Journal:

Journal of Computer and System Sciences

Année:

1996

Langue:

english

Fichier:

PDF, 271 KB

english, 1996

15

An Excursion to the Kolmogorov Random Strings

Harry Buhrman, Elvira Mayordomo

Journal:

Journal of Computer and System Sciences

Année:

1997

Langue:

english

Fichier:

PDF, 809 KB

english, 1997

16

Two Queries

Harry Buhrman, Lance Fortnow

Journal:

Journal of Computer and System Sciences

Année:

1999

Langue:

english

Fichier:

PDF, 162 KB

english, 1999

17

Hard Sets Are Hard to Find

Harry Buhrman, Dieter van Melkebeek

Journal:

Journal of Computer and System Sciences

Année:

1999

Langue:

english

Fichier:

PDF, 195 KB

english, 1999

18

The Communication Complexity of Enumeration, Elimination, and Selection

Andris Ambainis, Harry Buhrman, William Gasarch, Bala Kalyanasundaram, Leen Torenvliet

Journal:

Journal of Computer and System Sciences

Année:

2001

Langue:

english

Fichier:

PDF, 278 KB

english, 2001

19

Twenty questions to a p-selector

Harry Buhrman, Leen Torenvliet, Peter van Emde Boas

Journal:

Information Processing Letters

Année:

1993

Langue:

english

Fichier:

PDF, 358 KB

english, 1993

20

What can be efficiently reduced to the Kolmogorov-random strings?

Eric Allender, Harry Buhrman, Michal Koucký

Journal:

Annals of Pure and Applied Logic

Année:

2006

Langue:

english

Fichier:

PDF, 268 KB

english, 2006

21

Foreword

Journal:

Journal of Computer and System Sciences

Année:

2008

Langue:

english

Fichier:

PDF, 51 KB

english, 2008

22

The first peptides: The evolutionary transition between prebiotic amino acids and early proteins

Peter van der Gulik, Serge Massar, Dimitri Gilis, Harry Buhrman, Marianne Rooman

Journal:

Journal of Theoretical Biology

Année:

2009

Langue:

english

Fichier:

PDF, 405 KB

english, 2009

23

Quantum zero-error algorithms cannot be composed

Harry Buhrman, Ronald de Wolf

Journal:

Information Processing Letters

Année:

2003

Langue:

english

Fichier:

PDF, 94 KB

english, 2003

24

New applications of the incompressibility method: Part II

Harry Buhrman, Tao Jiang, Ming Li, Paul Vitányi

Journal:

Theoretical Computer Science

Année:

2000

Langue:

english

Fichier:

PDF, 98 KB

english, 2000

25

The relative power of logspace and polynomial time reductions

Harry Buhrman, Edith Spaan, Leen Torenvliet

Journal:

Computational Complexity

Année:

1993

Langue:

english

Fichier:

PDF, 973 KB

english, 1993

26

Completeness for nondeterministic complexity classes

Harry Buhrman, Steven Homer, Leen Torenvliet

Journal:

Theory of Computing Systems

Année:

1991

Langue:

english

Fichier:

PDF, 1.07 MB

english, 1991

27

Language compression and pseudorandom generators

Harry Buhrman, Troy Lee, Dieter van Melkebeek

Journal:

Computational Complexity

Année:

2005

Langue:

english

Fichier:

PDF, 275 KB

english, 2005

28

Robust Polynomials and Quantum Algorithms

Harry Buhrman, Ilan Newman, Hein Rohrig, Ronald de Wolf

Journal:

Theory of Computing Systems

Année:

2007

Langue:

english

Fichier:

PDF, 241 KB

english, 2007

29

Non-Uniform Reductions

Harry Buhrman, Benjamin Hescott, Steven Homer, Leen Torenvliet

Journal:

Theory of Computing Systems

Année:

2010

Langue:

english

Fichier:

PDF, 539 KB

english, 2010

30

On the importance of having an identity or, is consensus really universal?

Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul Vitanyi

Journal:

Distributed Computing

Année:

2006

Langue:

english

Fichier:

PDF, 194 KB

english, 2006

31

Learning parities in the mistake-bound model

Harry Buhrman, David García-Soriano, Arie Matsliah

Journal:

Information Processing Letters

Année:

2010

Langue:

english

Fichier:

PDF, 164 KB

english, 2010

32

Individual communication complexity

Harry Buhrman, Hartmut Klauck, Nikolai Vereshchagin, Paul Vitányi

Journal:

Journal of Computer and System Sciences

Année:

2007

Langue:

english

Fichier:

PDF, 176 KB

english, 2007

33

A lower bound for quantum search of an ordered list

Harry Buhrman, Ronald de Wolf

Journal:

Information Processing Letters

Année:

1999

Langue:

english

Fichier:

PDF, 72 KB

english, 1999

34

Classical Simulation of Entanglement Swapping with Bounded Communication

Branciard, Cyril, Brunner, Nicolas, Buhrman, Harry, Cleve, Richard, Gisin, Nicolas, Portmann, Samuel, Rosset, Denis, Szegedy, Mario

Journal:

Physical Review Letters

Année:

2012

Langue:

english

Fichier:

PDF, 146 KB

english, 2012

35

Splittings, Robustness, and Structure of Complete Sets

Buhrman, Harry, Hoene, Albrecht, Torenvliet, Leen

Journal:

SIAM Journal on Computing

Année:

1998

Langue:

english

Fichier:

PDF, 406 KB

english, 1998

36

Kolmogorov Random Graphs and the Incompressibility Method

Buhrman, Harry, Li, Ming, Tromp, John, Vitányi, Paul

Journal:

SIAM Journal on Computing

Année:

1999

Langue:

english

Fichier:

PDF, 266 KB

english, 1999

37

Randomness is Hard

Buhrman, Harry, Torenvliet, Leen

Journal:

SIAM Journal on Computing

Année:

2000

Langue:

english

Fichier:

PDF, 221 KB

english, 2000

38

Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method

Buhrman, Harry, Hoepman, Jaap-Henk, Vitányi, Paul

Journal:

SIAM Journal on Computing

Année:

1999

Langue:

english

Fichier:

PDF, 366 KB

english, 1999

39

A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem

Buhrman, Harry, van Melkebeek, Dieter, Regan, Kenneth W., Sivakumar, D., Strauss, Martin

Journal:

SIAM Journal on Computing

Année:

2000

Langue:

english

Fichier:

PDF, 280 KB

english, 2000

40

SPARSE Reduces Conjunctively to TALLY

Buhrman, Harry, Hemaspaandra, Edith, Longpré, Luc

Journal:

SIAM Journal on Computing

Année:

1995

Langue:

english

Fichier:

PDF, 1.10 MB

english, 1995

41

Resource-Bounded Kolmogorov Complexity Revisited

Buhrman, Harry, Fortnow, Lance, Laplante, Sophie

Journal:

SIAM Journal on Computing

Année:

2001

Langue:

english

Fichier:

PDF, 229 KB

english, 2001

42

Power from Random Strings

Allender, Eric, Buhrman, Harry, Koucký, Michal, van Melkebeek, Dieter, Ronneburger, Detlef

Journal:

SIAM Journal on Computing

Année:

2006

Langue:

english

Fichier:

PDF, 300 KB

english, 2006

43

Quantum Algorithms for Element Distinctness

Buhrman, Harry, Dürr, Christoph, Heiligman, Mark, Høyer, Peter, Magniez, Frédéric, Santha, Miklos, de Wolf, Ronald

Journal:

SIAM Journal on Computing

Année:

2005

Langue:

english

Fichier:

PDF, 137 KB

english, 2005

44

Quantum Property Testing

Buhrman, Harry, Fortnow, Lance, Newman, Ilan, Röhrig, Hein

Journal:

SIAM Journal on Computing

Année:

2008

Langue:

english

Fichier:

PDF, 206 KB

english, 2008

45

Compressibility and Resource Bounded Measure

Buhrman, Harry, Longpré, Luc

Journal:

SIAM Journal on Computing

Année:

2001

Langue:

english

Fichier:

PDF, 160 KB

english, 2001

46

Implications of superstrong non-locality for cryptography

Buhrman, Harry, Christandl, Matthias, Unger, Falk, Wehner, Stephanie, Winter, Andreas

Journal:

Proceedings Mathematical Physical & Engineering Sciences

Année:

2006

Langue:

english

Fichier:

PDF, 315 KB

english, 2006

47

A Realistic Model Under Which the Genetic Code is Optimal

Buhrman, Harry, Gulik, Peter T. S., Klau, Gunnar W., Schaffner, Christian, Speijer, Dave, Stougie, Leen

Journal:

Journal of Molecular Evolution

Année:

2013

Langue:

english

Fichier:

PDF, 470 KB

english, 2013

48

Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment

Buhrman, Harry, Christandl, Matthias, Hayden, Patrick, Lo, Hoi-Kwong, Wehner, Stephanie

Journal:

Physical Review A

Année:

2008

Langue:

english

Fichier:

PDF, 166 KB

english, 2008

49

Enumerations of the Kolmogorov Function

Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan and Leen Torenvliet

Journal:

Journal of Symbolic Logic

Année:

2006

Langue:

english

Fichier:

PDF, 2.23 MB

english, 2006

50

Implications of Superstrong Non-Locality for Cryptography

Harry Buhrman, Matthias Christandl, Falk Unger, Stephanie Wehner and Andreas Winter

Journal:

Proceedings Mathematical Physical & Engineering Sciences

Année:

2006

Langue:

english

Fichier:

PDF, 1.70 MB

english, 2006